1
1.0

Jun 28, 2018
06/18

by
Nadine Kroher; José-Miguel Díaz-Báñez; Joaquin Mora; Emilia Gómez

texts

######
eye 1

######
favorite 0

######
comment 0

Flamenco is a music tradition from Southern Spain which attracts a growing community of enthusiasts around the world. Its unique melodic and rhythmic elements, the typically spontaneous and improvised interpretation and its diversity regarding styles make this still largely undocumented art form a particularly interesting material for musicological studies. In prior works it has already been demonstrated that research on computational analysis of flamenco music, despite it being a relatively...

Topics: Sound, Information Retrieval, Computing Research Repository

Source: http://arxiv.org/abs/1510.04029

26
26

Sep 21, 2013
09/13

by
José M. Díaz-Bañez; Ruy Fabila-Monroy; Pablo Pérez-Lantero

texts

######
eye 26

######
favorite 0

######
comment 0

Given a set $S$ of $n$ points in the plane, a \emph{radial ordering} of $S$ with respect to a point $p$ (not in $S$) is a clockwise circular ordering of the elements in $S$ by angle around $p$. If $S$ is two-colored, a \emph{colored radial ordering} is a radial ordering of $S$ in which only the colors of the points are considered. In this paper, we obtain bounds on the number of distinct non-colored and colored radial orderings of $S$. We assume a strong general position on $S$, not three...

Source: http://arxiv.org/abs/1204.0547v1

0
0.0

Jun 29, 2018
06/18

by
S. Bereg; L. E. Caraballo; J. M. Díaz-Báñez; M. A. Lopez

texts

######
eye 0

######
favorite 0

######
comment 0

Fault tolerance is increasingly important for unmanned autonomous vehicles. For example, in a multi robot system the agents need the ability to effectively detect and tolerate internal failures in order to continue performing their tasks without the need for immediate human intervention. The system must react to unplanned events in order to optimize the task allocation between the robots. In a broad sense, the resilience of a system can be defined as the ability to maintain or recover a stable...

Topics: Robotics, Combinatorics, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1604.08804

2
2.0

Jun 26, 2018
06/18

by
L. Barba; L. E. Caraballo; J. M. Díaz-Báñez; R. Fabila-Monroy; E. Pérez-Castillo

texts

######
eye 2

######
favorite 0

######
comment 0

We say that a polygon inscribed in the circle is asymmetric if it contains no two antipodal points being the endpoints of a diameter. Given $n$ diameters of a circle and a positive integer $k

Topics: Computational Geometry, Metric Geometry, Combinatorics, Mathematics, Computing Research Repository

Source: http://arxiv.org/abs/1501.07721

43
43

Sep 18, 2013
09/13

by
J. M. Díaz-Báñez; R. Fabila-Monroy; P. Pérez-Lantero; I. Ventura

texts

######
eye 43

######
favorite 0

######
comment 0

Let $S$ be a 2-colored (red and blue) set of $n$ points in the plane. A subset $I$ of $S$ is an island if there exits a convex set $C$ such that $I=C\cap S$. The discrepancy of an island is the absolute value of the number of red minus the number of blue points it contains. A convex partition of $S$ is a partition of $S$ into islands with pairwise disjoint convex hulls. The discrepancy of a convex partition is the discrepancy of its island of minimum discrepancy. The coarseness of $S$ is the...

Source: http://arxiv.org/abs/1211.2020v2

20
20

Sep 18, 2013
09/13

by
José Miguel Díaz-Báñez; Matias Korman; Pablo Pérez-Lantero; Alexander Pilz; Carlos Seara; Rodrigo I. Silveira

texts

######
eye 20

######
favorite 0

######
comment 0

We consider a natural variation of the concept of \emph{stabbing} a segment by a simple polygon: a segment is stabbed by a simple polygon $\mathcal{P}$ if at least one of its two endpoints is contained in $\mathcal{P}$. A segment set $S$ is stabbed by $\mathcal{P}$ if every segment of $S$ is stabbed by $\mathcal{P}$. We show that if $S$ is a set of pairwise disjoint segments, the problem of computing the minimum perimeter polygon stabbing $S$ can be solved in polynomial time. We also prove that...

Source: http://arxiv.org/abs/1211.1490v2

18
18

Sep 20, 2013
09/13

by
José Miguel Díaz-Báñez; Matias Korman; Pablo Pérez-Lantero; Inmaculada Ventura

texts

######
eye 18

######
favorite 0

######
comment 0

In this paper we study a facility location problem in the plane in which a single point (facility) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time from the clients to the facility, using the $L_1$ or Manhattan metric. The rapid transit line is given by a segment with any length and orientation, and is an alternative transportation line that can be used by the clients to reduce their travel time to the facility. We study the variant of the...

Source: http://arxiv.org/abs/1205.1556v1

34
34

Sep 21, 2013
09/13

by
O. Aichholzer; L. E. Caraballo; J. M. Díaz-Báñez; R. Fabila-Monroy; C. Ochoa; P. Nigsch

texts

######
eye 34

######
favorite 0

######
comment 0

Let $S$ be a set of $2n$ points on a circle such that for each point $p \in S$ also its antipodal (mirrored with respect to the circle center) point $p'$ belongs to $S$. A polygon $P$ of size $n$ is called \emph{antipodal} if it consists of precisely one point of each antipodal pair $(p,p')$ of $S$. We provide a complete characterization of antipodal polygons which maximize (minimize, respectively) the area among all antipodal polygons of $S$. Based on this characterization, a simple linear...

Source: http://arxiv.org/abs/1301.6667v1

28
28

Sep 21, 2013
09/13

by
J. M. Díaz-Bañez; M. Korman; P. Pérez-Lantero; I. Ventura

texts

######
eye 28

######
favorite 0

######
comment 0

In this paper we study a facility location problem in the plane in which a single point (facility) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time of the clients to the facility, using the $L_1$ or Manhattan metric. The rapid transit line is represented by a line segment with fixed length and arbitrary orientation. The highway is an alternative transportation system that can be used by the clients to reduce their travel time to the...

Source: http://arxiv.org/abs/1104.0753v3

22
22

Sep 20, 2013
09/13

by
José Miguel Díaz-Báñez; Matias Korman; Pablo Pérez-Lantero; Inmaculada Ventura

texts

######
eye 22

######
favorite 0

######
comment 0

We study a variation of the 1-center problem in which, in addition to a single supply facility, we are allowed to locate a highway. This highway increases the transportation speed between any demand point and the facility. That is, given a set $S$ of points and $v>1$, we are interested in locating the facility point $f$ and the highway $h$ that minimize the expression $\max_{p\in S}d_{h}(p,f)$, where $d_h$ is the time needed to travel between $p$ and $f$. We consider two types of highways...

Source: http://arxiv.org/abs/1205.1882v1

31
31

Oct 27, 2014
10/14

by
Llorens, Franc; Banez-Coronel, Monica; Pantano, Lorena; del Rio, Jose Antonio; Ferrer, Isidre; Estivill, Xavier; Marti, Eulalia

texts

######
eye 31

######
favorite 0

######
comment 0

This article is from BMC Genomics , volume 14 . Abstract Background: MicroRNAs (miRNAs) are short non-coding regulatory RNAs that control gene expression usually producing translational repression and gene silencing. High-throughput sequencing technologies have revealed heterogeneity at length and sequence level for the majority of mature miRNAs (IsomiRs). Most isomiRs can be explained by variability in either Dicer1 or Drosha cleavage during miRNA biogenesis at 5’ or 3’ of the miRNA...

Source: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3751341

0
0.0

Jun 28, 2018
06/18

by
Oswin Aichholzer; Nieves Atienza; Ruy Fabila-Monroy; Pablo Perez-Lantero; Jose M. Dıaz-Báñez; David Flores-Peñaloza; Birgit Vogtenhuber; Jorge Urrutia

texts

######
eye 0

######
favorite 0

######
comment 0

Let $P$ be a set of $n$ points in general position in the plane, $r$ of which are red and $b$ of which are blue. In this paper we prove that there exist: for every $\alpha \in \left [ 0,\frac{1}{2} \right ]$, a convex set containing exactly $\lceil \alpha r\rceil$ red points and exactly $\lceil \alpha b \rceil$ blue points of $P$; a convex set containing exactly $\left \lceil \frac{r+1}{2}\right \rceil$ red points and exactly $\left \lceil \frac{b+1}{2}\right \rceil$ blue points of $P$....

Topics: Computational Geometry, Computing Research Repository

Source: http://arxiv.org/abs/1510.01819

54
54

Oct 21, 2014
10/14

by
Friedlander, Marc R; Lizano, Esther; Houben, Anna JS; Bezdan, Daniela; Banez-Coronel, Monica; Kudla, Grzegorz; Mateu-Huertas, Elisabet; Kagerbauer, Birgit; Gonzalez, Justo; Chen, Kevin C; LeProust, Emily M; Marti, Eulalia; Estivill, Xavier

texts

######
eye 54

######
favorite 0

######
comment 0

This article is from Genome Biology , volume 15 . Abstract Background: MicroRNAs (miRNAs) are established regulators of development, cell identity and disease. Although nearly two thousand human miRNA genes are known and new ones are continuously discovered, no attempt has been made to gauge the total miRNA content of the human genome. Results: Employing an innovative computational method on massively pooled small RNA sequencing data, we report 2,469 novel human miRNA candidates of which 1,098...

Source: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4054668